Firefly Algorithm Based on Euclidean Metric and Dimensional Mutation
نویسندگان
چکیده
Firefly algorithm is a meta-heuristic stochastic search with strong robustness and easy implementation. However, it also has some shortcomings, such as the "oscillation" phenomenon caused by too many attractions, which makes convergence speed slow or premature. In original FA, full attraction model consume lot of evaluation times, time complexity high. Therefore, this paper, novel firefly (EMDmFA) based on Euclidean metric (EM) dimensional mutation (DM) proposed. The EM strategy learn from its nearest neighbors. When better than neighbors, learns best individuals in population. It improves FA dramatically reduces computational complexity. At same time, DM ability to jump out local optimum. experimental results show that proposed EMDmFA significantly accuracy solution most state-of-the-art variants.
منابع مشابه
Dynamic Replication based on Firefly Algorithm in Data Grid
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...
متن کاملPerformance Research on Firefly Optimization Algorithm with Mutation
Firefly algorithm is an optimization algorithm which mimics the behavior of fireflies to solve problems. In this paper, firefly algorithm with mutation is researched and the performance effect of parameter settings is studied in order to show which setting is more suitable for solving optimization problems. It is tested on ten standard function problems and compared with original firefly algori...
متن کاملDocument Clustering Based on Firefly Algorithm
Corresponding Author: Athraa Jasim Mohammed School of Computing, Universiti Utara Malaysia, Kedah, Malaysia Email: [email protected] Abstract: Document clustering is widely used in Information Retrieval however, existing clustering techniques suffer from local optima problem in determining the k number of clusters. Various efforts have been put to address such drawback and this includes...
متن کاملMetric Derivations on Euclidean and Non-euclidean Spaces
As introduced by Weaver, (metric) derivations extend the notion of differential operators on Euclidean spaces and provide a linear differentiation theory that is well-defined on all metric spaces with Borel measures. The main result of this paper is a rigidity theorem for measures on Euclidean spaces that support a maximal number of derivations. The proof relies substantially on ideas from geom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Cognitive Informatics and Natural Intelligence
سال: 2021
ISSN: ['1557-3958', '1557-3966']
DOI: https://doi.org/10.4018/ijcini.286769